A powerful heuristic for telephone gossiping
نویسندگان
چکیده
A refined heuristic for computing schedules for gossiping in the telephone model is presented. The heuristic is fast: for a network with n nodes and m edges, requiring R rounds for gossiping, the running time is O(R n log n m) for all tested classes of graphs. This moderate time consumption allows to compute gossiping schedules for networks with more than 10,000 PUs and 100,000 connections. The heuristic is good: in practice the computed schedules never exceed the optimum by more than a few rounds. The heuristic is versatile: it can also be used for broadcasting and more general information dispersion patterns. It can handle both the unitcost and the linear-cost model. A second heuristic, is less versatile, but by refined search techniques it can tackle even larger problems. Together these heuristics lead to strongly improved bounds for gossiping and broadcasting on many of the most important interconnection networks such as shuffleexchange networks, butterflies and pancakes.
منابع مشابه
Approximation algorithms for information dissemination problems
Broadcasting and gossiping are known to be NP hard problems This paper deals with approximation algorithms for such problems We consider both round complexity and step complexity in the telephone model After an overview of previously derived approximation algorithms we present new strategies for broadcasting and gossiping in any graphs Broadcasting strategies are based on the construction of ed...
متن کاملFaster Gossiping on Butter ies?
Gossiping has been considered intensively for butterries and \regular" butterries (which have no wrap-around connections). In the telephone communication model, for a butterry of order k, the best previous gossiping algorithms require 2 1 = 2 k and 3 k communication rounds, respectively. By new asymptotic methods we break through these bounds, proving new bounds of 2 1 = 4 k + o(k) and 2 1 = 2 ...
متن کاملProximity neighbor selection in tree-based structured peer-to-peer overlays
Structured peer-to-peer (p2p) overlay networks provide a useful substrate for building distributed applications. They assign object keys to overlay nodes and provide a primitive to route a message to the node responsible for a key. Proximity neighbor selection (PNS) can be used to achieve both low delay routes and low bandwidth usage but it introduces high overhead. This paper presents a detail...
متن کاملProbabilistic Job Scheduling for Distributed Real-time Applications
We describe a heuristic for dynamically scheduling time-constrained tasks in a distributed environment. When a task is submitted to a node, the scheduling software tries to schedule the task locally so as to meet its deadline. If that is not feasible, it tries to locate another node where this could be done with a high probability of success. Nodes in the system inform each other about their st...
متن کامل